Scale Free Information Systems Networks
نویسندگان
چکیده
Many real, complex networks have been shown to be scale-free. Scale-free in networks mean that their degree distribution is independent of the network size, have short path lengths and are highly clustered. We identify the qualities of scale-free networks, and discuss the mathematical derivations and numerically simulated outcomes of various deterministic scale-free models. Information Systems networks are a set of individual Information Systems that exchange meaningful data among themselves. However, for various reasons, they do not naturally grow in a scale-free manner. In this topic, we will specifically examine a technique proposed by MITRE that allows information to be exchanged in an efficient manner between Information System nodes. With this technique, we will show that a scale-free Information System Network is sound in theory and practice, state the characteristics of such networks and demonstrate how such a system can be constructed. Advisor: Stuart E. Madnick Title: John Norris Maguire Professor of Information Technology & MIT Sloan School of Management & Professor Engineering Systems MIT School of Engineering
منابع مشابه
Finding important hubs in scale-free gene networks
Several biological networks have been recently found to demonstrate scale-free and smallworld behavior instead of random graph characteristics. It is very important to find the hubs (genes, proteins, metabolites and so on) which dominate the topology of scale-free networks, since those are usually of great biological significance. In this paper, we will develop a general information theory meth...
متن کاملPerformance and Robustness of Cellular Automata Computation on Irregular Networks
We investigate the performances of collective task-solving capabilities and the robustness of complex networks of automata using the density and synchronization problems as typical cases. We show by computer simulations that evolved Watts–Strogatz smallworld networks have superior performance with respect to several kinds of scale-free graphs. In addition, we show that Watts–Strogatz networks a...
متن کاملMerging Similarity and Trust Based Social Networks to Enhance the Accuracy of Trust-Aware Recommender Systems
In recent years, collaborative filtering (CF) methods are important and widely accepted techniques are available for recommender systems. One of these techniques is user based that produces useful recommendations based on the similarity by the ratings of likeminded users. However, these systems suffer from several inherent shortcomings such as data sparsity and cold start problems. With the dev...
متن کاملScale Free Networks; A Literature Review
The Scale-Free Networks model is considered a significant discovery because it has been successfully applied to many complex real-world networks and proved valid. The successful application of the recently discovered model deemed the other model, the random network model, questionable. The presence of scale-free emerging properties in many “real-world” networks provides initial evidence that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006